A structured rank-revealing method for Sylvester matrix

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Structured Rank - Revealing Method for Sylvester Matrix 1 )

We propose a displacement structure based rank-revealing algorithm for Sylvester matrix, then apply it to compute approximate greatest common division of two univariate polynomials with floating-point coefficients. This structured rank-revealing method is based on a stabilized version of the generalized Schur algorithm [8], and is a fast rank-revealing method in the sense that, all computations...

متن کامل

Structured Low Rank Approximation of a Sylvester Matrix

The task of determining the approximate greatest common divisor (GCD) of univariate polynomials with inexact coefficients can be formulated as computing for a given Sylvester matrix a new Sylvester matrix of lower rank whose entries are near the corresponding entries of that input matrix. We solve the approximate GCD problem by a new method based on structured total least norm (STLN) algorithms...

متن کامل

ABS METHOD FOR SOLVING FUZZY SYLVESTER MATRIX EQUATION

The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation  

متن کامل

Fast Low Rank Approximation of a Sylvester Matrix by Structured Total Least Norm

The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with a Sylvester matrix. In this paper, we present an algorithm based on fast Structured Total Least Norm(STLN) for constructing a Sylvester matrix of given lower rank and obtaining the nearest perturbed polynomials with exact GCD of given...

متن کامل

A Symmetric Rank - Revealing Toeplitz Matrix

In signal and image processing, regularization often requires a rank-revealing decomposition of a symmetric Toeplitz matrix with a small rank deeciency. In this paper, we present an eecient factorization method that exploits symmetry as well as the rank and Toeplitz properties of the given matrix.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2008

ISSN: 0377-0427

DOI: 10.1016/j.cam.2007.01.032